Min-degree constrained minimum spanning tree problem: New formulation via Miller-Tucker-Zemlin constraints
نویسندگان
چکیده
Available online 24 March 2009
منابع مشابه
New formulations of the Hop-Constrained Minimum Spanning Tree problem via Miller-Tucker-Zemlin constraints
0377-2217/$ see front matter 2011 Elsevier B.V. A doi:10.1016/j.ejor.2011.01.051 ⇑ Corresponding author. Tel.: +90 312 29
متن کاملA New 0–1 ILP Approach for the Bounded Diameter Minimum Spanning Tree Problem
The bounded diameter minimum spanning tree (BDMST) problem is NP-hard and appears e.g. in communication network design when considering certain quality of service requirements. Prior exact approaches for the BDMST problem mostly rely on network flow-based mixed integer linear programming and Miller-Tucker-Zemlin-based formulations. This article presents a new, compact 0–1 integer linear program...
متن کاملA New Ant Colony Optimization Approach for the Degree-Constrained Minimum Spanning Tree Problem Using Prüfer and Blob Codes Tree Coding
This chapter describes a novel ACO algorithm for the degree-constrained minimum spanning tree (d-MST) problem. Instead of constructing the d-MST directly on the construction graph, ants construct the encoded d-MST. Two well-known tree codings are used: the Prüfer code, and the more recent Blob code (Picciotto, 1999). Both of these tree codings are bijective because they represent each spanning ...
متن کاملInteger Programming Formulations for the k-Cardinality Tree Problem
In this paper, we present two Integer Programming formulations for the k-Cardinality Tree Problem. The first is a multiflow formulation while the second uses a lifting of the Miller-Tucker-Zemlin constraints. Based on our computational experience, we suggest a two-phase exact solution approach that combines two different solution techniques, each one exploring one of the proposed formulations.
متن کاملA note on the lifted Miller-Tucker-Zemlin subtour elimination constraints for the capacitated vehicle routing problem
Corrected Miller–Tucker–Zemlin type subtour elimination constraints for the capacitated vehicle routing problem are presented. 2003 Elsevier B.V. All rights reserved.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Computers & OR
دوره 37 شماره
صفحات -
تاریخ انتشار 2010